Volume Computation for Polytopes and Partition Functions for Classical Root Systems
نویسندگان
چکیده
This paper presents an algorithm to compute the value of the inverse Laplace transforms of rational functions with poles on arrangements of hyperplanes. As an application, we present an efficient computation of the partition function for classical root systems.
منابع مشابه
Lattice polytopes cut out by root systems and the Koszul property
We show that lattice polytopes cut out by root systems of classical type are normal and Koszul, generalizing a well-known result of Bruns, Gubeladze, and Trung in type A. We prove similar results for Cayley sums of collections of polytopes whose Minkowski sums are cut out by root systems. The proofs are based on a combinatorial characterization of diagonally split toric varieties.
متن کاملOn the Complexity of Sparse Elimination
Sparse elimination exploits the structure of a set of multivariate polynomials by measuring complexity in terms of Newton polytopes. We examine polynomial systems that generate 0-dimensional ideals: a generic monomial basis for the coordinate ring of such a system is de ned from a mixed subdivision. We o er a simple proof of this known fact and relate the computation of a monomial basis to the ...
متن کاملDevelopment and Application of Aqueous Two-Phase Partition for the Recovery and Separation of Recombinant Phenylalanine Dehydrogenase
Aqueous two-phase systems (ATPS) have emerged as a powerful extraction method for the downstream processing of bio-molecules. The aim of this work was to investigate the possibility of utilizing ATPS for the separation of recombinant Bacillus sphaericus phenylalanine dehydrogenase (PheDH). Polyethylene glycol (PEG) and ammonium sulfate systems were selected for our experi...
متن کاملApplications of Equivariant Cohomology
We will discuss the equivariant cohomology of a manifold endowed with the action of a Lie group. Localization formulae for equivariant integrals are explained by a vanishing theorem for equivariant cohomology with generalized coefficients. We then give applications to integration of characteristic classes on symplectic quotients and to indices of transversally elliptic operators. In particular,...
متن کاملA Novel Trust Computation Method Based on User Ratings to Improve the Recommendation
Today, the trust has turned into one of the most beneficial solutions to improve recommender systems, especially in the collaborative filtering method. However, trust statements suffer from a number of shortcomings, including the trust statements sparsity, users' inability to express explicit trust for other users in most of the existing applications, etc. Thus to overcome these problems, this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 35 شماره
صفحات -
تاریخ انتشار 2006